TOT, a Fast Multivariate Public Key Cryptosystem with Basic Secure Trapdoor

نویسندگان

  • Wuqiang Shen
  • Shaohua Tang
چکیده

In this paper, we design a novel one-way trapdoor function, and then propose a new multivariate public key cryptosystem called TOT, which can be used for encryption, signature and authentication. Through analysis, we declare that TOT is secure, because it can resist current known algebraic attacks if its parameters are properly chosen. Some practical implementations for TOT are also given, and whose security level is at least 2. The comparison shows that TOT is more secure than HFE, HFEv and Quartz (when n ≥ 81 and DHFE ≥ 129, HFE is still secure), and it can reach almost the same speed of computing the secret map by C∗ and Sflash (even though C∗ was broken, its high speed has been affirmed).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multivariate Quadratic Trapdoor Functions Based on Multivariate Quadratic Quasigroups

We have designed a new class of multivariate quadratic trapdoor functions. The trapdoor functions are generated by quasigroup string transformations based on a class of quasigroups called multivariate quadratic quasigroups (MQQ). The public key schemes using these trapdoor functions are bijective mappings, they do not perform message expansions and can be used both for encryption and signatures...

متن کامل

A Feebly Secure Trapdoor Function

In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are provably harder to invert than to compute, but the complexity (viewed as circuit complexity over circuits with arbitrary binary gates) is amplified by a constant factor only (with the factor approaching 2). In traditional cryptogra...

متن کامل

Analysis of Intermediate Field Systems

We study a new generic trapdoor for public key multivariate cryptosystems, called IFS for Intermediate Field Systems, which can be seen as dual to HFE. This new trapdoor relies on the possibility to invert a system of quadratic multivariate equations with few (logarithmic with respect to the security parameter) unknowns on an intermediate field thanks to Gröbner bases algorithms. We provide a c...

متن کامل

When Stream Cipher Analysis Meets Public-Key Cryptography

Inspired by fast correlation attacks on stream ciphers, we present a stream cipher-like construction for a public-key cryptosystem whose security relies on two problems: finding a low-weight multiple of a given polynomial and a Hidden Correlation problem. We obtain a weakly secure public-key cryptosystem we call TCHo (as for Trapdoor Cipher, Hardware Oriented). Using the Fujisaki-Okamoto constr...

متن کامل

Public Key Cryptography Using Permutation P-polynomials over Finite Fields

In this paper we propose an efficient multivariate public key cryptosystem based on permutation p-polynomials over finite fields. We first characterize a class of permutation ppolynomials over finite fields Fqm and then construct a trapdoor function using this class of permutation p-polynomials. The complexity of encryption in our public key cryptosystem is O(m) multiplication which is equivale...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2013  شماره 

صفحات  -

تاریخ انتشار 2013